Lowest common ancestor - PDFSEARCH.IO - Document Search Engine

Lowest common ancestor
Results: 42

#	Item
21	Select-Project Queries over XML Documents Sara Cohen, Yaron Kanza, and Yehoshua Sagiv Dept. of Computer Science, The Hebrew University, Jerusalem 91904, Israel {sarina, yarok, sagiv}@cs.huji.ac.il Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-06-11 08:15:37 Lowest common ancestor XQuery FO N1 Spaceflight Theoretical computer science Applied mathematics
22	PDF Document Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2012-09-26 07:51:49 XQuery Lowest common ancestor B-tree Search engine indexing Web search engine Information science Information retrieval Graph theory
23	Coursework COMS31900 – Advanced AlgorithmsNovember 2013 Deadline is Sunday, 15 December 2013 at 23:59:59. This is both the normal and late deadline. Submission. The coursework must be submitted online as Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:17 Computational complexity theory Lowest common ancestor Suffix tree String Time complexity Algorithm Theoretical computer science Mathematics Applied mathematics
24	Lowest common ancestor Advanced Algorithms – COMS31900 Preprocess a tree T (with n nodes) to answer lowest common ancestor queries Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:20 Theoretical computer science Cartesian tree Range Minimum Query Graph theory Binary trees Lowest common ancestor
25	On the Complexity of Query Answering over Incomplete XML Documents Amelie ´ Gheerbrant Leonid Libkin Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-04 06:15:23 Complexity classes Conjunctive query Database theory Relational model Data integration FO Relational algebra Lowest common ancestor SQL Computing Theoretical computer science Data management
26	Optimizing Taxonomic Semantic Web Queries using Labeling Schemesy V. Christophides G. Karvounarakis D. Plexousakis Institute of Computer Science, FORTH, Vassilika Vouton, P.O.Box 1385, GR[removed], Heraklion, Greece fchris Add to Reading List Source URL: 139.91.183.30 Language: English - Date: 2008-12-01 20:09:16 Semantic Web Knowledge representation B-tree Binary trees PostgreSQL Lowest common ancestor R-tree Rope Resource Description Framework Graph theory Computing Data management
27	Nearest Keyword Search in XML Documents Yufei Tao Stavros Papadopoulos Cheng Sheng Kostas Stefanidis Department of Computer Science and Engineering Chinese University of Hong Kong New Territories, Hong Kong {taoyf, stavr Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-03-08 19:35:47 Binary trees Distributed data storage Search algorithms Rope Tree Lowest common ancestor B-tree Decomposition method Hilbert R-tree Graph theory Computing Mathematics
28	Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data Qiang Zeng Xiaorui Jiang Add to Reading List Source URL: vldb.org Language: English - Date: 2012-04-26 08:00:03 Knowledge representation Tree Reachability Bipartite graph Rope Lowest common ancestor Connectivity T-tree B-tree Graph theory Binary trees Graph connectivity
29	On Labeling Schemes for the Semantic Web Michel Scholl Sotirios Tourtounis Institute of Computer Science Add to Reading List Source URL: 139.91.183.30 Language: English - Date: 2008-12-01 20:09:07 Database management systems B-tree Binary tree Lowest common ancestor Query optimizer PostgreSQL R-tree Rope Tree Graph theory Computing Data management
30	Compact Representation for Answer Sets of n-ary Regular Queries Kazuhiro Inaba1 and Haruo Hosoya1 The University of Tokyo, {kinaba,hahosoya}@is.s.u-tokyo.ac.jp Abstract. An n-ary query over trees takes an input tree t a Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2010-10-09 10:18:25 R-tree Rope Tree decomposition Tree traversal Tree T-tree Graph theory Binary trees Lowest common ancestor